Graph Embedding
نویسنده
چکیده
Some of the parameters used to analyze the efficiency of an embedding are dilation, expansion, edge congestion and wirelength. If e = (u, v) ∈E (G), then the length of Pf (e) in H is called the dilation of the edge e. The maximal dilation over all edges of G is called the dilation of the embedding f. The dilation of embedding G into H is the minimum dilation taken over all embeddings f of G into H.
منابع مشابه
Detecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملLink Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملEmbedding Right-angled Artin Groups into Graph Braid Groups
We construct an embedding of any right-angled Artin group into a graph braid group. We include an observation which decreases the number of strands of the graph braid group required for this embedding, yielding an example of a hyperbolic surface subgroup embedded in a two strand planar graph braid group.
متن کاملMILE: A Multi-Level Framework for Scalable Graph Embedding
Recently there has been a surge of interest in designing graph embedding methods. Few, if any, can scale to a large-sized graph with millions of nodes due to both computational complexity and memory requirements. In this paper, we relax this limitation by introducing the MultI-Level Embedding (MILE) framework – a generic methodology allowing contemporary graph embedding methods to scale to larg...
متن کاملGraph Embedding and Nonlinear Dimensionality Reduction
Graph Embedding and Nonlinear Dimensionality Reduction
متن کاملA Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications
Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful applications such as node classification, node recommendation, link prediction, etc. However, most graph analytics methods suffer the high computation and space cost. ...
متن کامل